A unified method to construct neural network decoders for arbitrary codes and decoding rules
نویسندگان
چکیده
This paper presents a uni ed method to construct decoders which are implemented by a feedforward neural network. By setting the parameters of the network, it can decode any given code {(ci; Di); i=1; : : : ; M}: We focus on the case that the sets D1; : : : ; DM are weighted distance spheres. Properties and constructions of weighted distance spheres are developed. Weighted distance perfect codes are de ned and studied. Finally, the complexity of the network decoder is discussed. c © 2001 Elsevier Science B.V. All rights reserved. MSC: 94B35
منابع مشابه
Analog Neural Networks as Decoders
Analog neural networks with feedback can be used to implement l(Winner-Take-All (KWTA) networks. In turn, KWTA networks can be used as decoders of a class of nonlinear error-correcting codes. By interconnecting such KWTA networks, we can construct decoders capable of decoding more powerful codes. We consider several families of interconnected KWTA networks, analyze their performance in terms of...
متن کاملUnified Error Probability Analysis for Error Correcting Codes with Different Decoding Algorithms
The error rate of error correcting codes with soft-decision-decoding rarely has a closed-form expression. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for a low signal-to-noise ratios region and become looser when a suboptimum decoding algorithm is used. The radius of decision re...
متن کاملNeural Network Decoders for Linear Block Codes
This paper presents a class of neural networks suitable for the application of decoding error-correcting codes.The neural model is basically a perceptron with a high-order polynomial as its discriminant function. A single layer of high-order perceptrons is shown to be able to decode a binary linear block code with at most 2 weights in each perceptron, where m is the parity length. For some subc...
متن کاملConvolutional Decoders for Amateur Packet Radio
This paper describes two freely available convolutional decoders written in the C language. One implements the Fano algorithm for sequentially decoding three rate l/2 K=32 codes while the other implcmcnts the Viterbi algorithm for maximum likelihood decoding of the rate l/2 K=7 NASA Standard code. Both support 8-W soft-decision decoding with arbitrary metric tables and perform according to theory.
متن کاملMetaheuristic Algorithms for Decoding Binary Linear Codes
This paper introduces two decoders for binary linear codes based on Metaheuristics. The first one uses a genetic algorithm and the second is based on a combination genetic algorithm with a feed forward neural network. The decoder based on the genetic algorithms (DAG) applied to BCH and convolutional codes give good performances compared to Chase-2 and Viterbi algorithm respectively and reach th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 238 شماره
صفحات -
تاریخ انتشار 2001